Computing by Observing Change in Insertion/Deletion Systems

نویسنده

  • Peter Leupold
چکیده

Computing by Observing is a theoretical model for computation that tries to formalize the standard setup of experiments in natural sciences into a model of computation. We explore insertion/deletion systems as underlying systems in a continuation of work on insertion systems. The main result states that insertion and deletion rules with contexts of length one and insertions / deletions of size one suffice to achieve computational completeness in the framework of observing change.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Modelling Intermolecular Structures and Defining Ambiguity in Gene Sequences using Matrix Insertion-Deletion Systems

Gene insertion and deletion are considered as the basic operations in DNA processing and RNA editing. Based on these evolutionary transformations, a computing model has been formulated in formal language theory known as insertion-deletion systems. Recently, in [6], a new computing model named Matrix insertion-deletion system has been introduced to model various bio-molecular structures such as ...

متن کامل

Change Detection in Web Page and in Flat Files

Users are interested in current web pages contents in optimum time. In this paper, we describe the technique to detect multiple changes in a web page or Flat files in form of insertion or deletion of the content or structure change. This efficient approach is suitable for client application and for implementing server applications that could serve the needs of users in monitoring modifications ...

متن کامل

At the Crossroads of Linguistics, DNA Computing, and Formal Language Theory: Characterizing RE Using Insertion-Deletion Systems

Several characterizations of recursively enumerable (RE) languages are presented, using insertion-deletion systems. Such a system generates the elements of a language by inserting and deleting words, according to their contexts (the insertiondeletion rules are triples (u, z, v), with the meaning that z can be inserted or deleted in/from the context (u, v)). Grammars based on insertion rules wer...

متن کامل

On the Ambiguity and Complexity Measures of Insertion-Deletion Systems

In DNA processing and RNA editing, gene insertion and deletion are considered as the basic operations. Based on the above evolutionary transformations, a computing model has been formulated in formal language theory known as insertion-deletion systems. In this paper we study about ambiguity and complexity measures of these systems. First, we define the various levels of ambiguity (i = 0, 1, 2, ...

متن کامل

Improving the Resilience of Military Hospitals Through Self-Adaptation of Hospital Systems Using Organic Computing

Background and Aim: Among the failures of a disaster, the disruption of the critical infrastructure of the community causes the most damage to society. Therefore, the ability of critical infrastructure such as hospitals to anticipate, absorb, adapt or rapidly recover from a devastating event is essential. The purpose of this study is to design a self-adaptive model for resilient hospital system...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012